Applications of Classical Recursion Theory to Computer Science

نویسنده

  • Carl H. Smith
چکیده

Three applications oE intensional recursion theory to computer science are presented. Proof Lechn iqut.-.i are used, in some cases, as a criterion of appliciibiLity. The first example distinguishes various tormy of recursion as programming tools. A highly iccur-jivc proof of the famous speed up theorem from complexity theory is presented. The final application concerns the synthesis of programs given examples ot Llic-ir intended behavior. Supported by NSF grant MCS 7903912. This report iu based on a lecture delivered at Logic Colloquium '79, Leeds England, and will appear as part of the proceedings of that conference. Applications of Classical Recursion Theory to Computer Science

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real recursive functions and their hierarchy

In the last years, recursive functions over the reals (Theoret. Comput. Sci. 162 (1996) 23) have been 9 considered, first as a model of analog computation, and second to obtain analog characterizations of classical computational complexity classes (Unconventional Models of Computation, UMC 2002, 11 Lecture Notes in Computer Science, Vol. 2509, Springer, Berlin, pp. 1–14). However, one of the op...

متن کامل

Computability and information in models of randomness and chaos

This paper presents a short survey of some recent approaches relating different areas: deterministic chaos and computability. Chaos, in classical physics, may be approached by dynamical (equationally determined) systems or stochastic ones (as random processes). Now, randomness has also been effectively modeled with recursion theoretic tools by P. Martin-Löf. We recall its connections to Kolmogo...

متن کامل

Basic Logic and Fregean Set Theory

It is tempting to conclude that classical mathematics is vindicated by its success, in particular by its applicability to the natural sciences. Constructive mathematics and intuitionism, on the other hand, lost by being too puritanical, and by making it too hard to prove results constructively that are easily shown to be true by classical means. Its sole rôle is that of servant to classical mat...

متن کامل

Iranian EFL Learners’ Perception of the Efficacy and Affordance of Activity Theory-based Computer Assisted Language Learning in Writing Achievement

Second language writing instruction has been greatly influenced by the growing importance of technology and the recent shift of paradigm from a cognitive to a social orientation in second language acquisition (Lantolf & Thorne, 2006). Therefore, the applications of computer assisted language learning and activity theory have been suggested as a promising framework for writing studies. The prese...

متن کامل

Real Recursive Functions and Baire Classes

Recursive functions over the reals [6] have been considered, first as a model of analog computation, and second to obtain analog characterizations of classical computational complexity classes [2]. However, one of the operators introduced in the seminal paper by Cris Moore (in 1996), the minimalization operator, creates some difficulties: (a) although differential recursion (the analog counterp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011